基于时空的弱点状运动目标检测技术

如何在复杂背景下持续有效地检测目标位置,一直是研究者们需要面对的主要挑战。本文在研究红外点状移动目标特征的基础上,根据目标无纹理,无形状的特性,提出一种改进的形态学目标增强算法,并利用目标连续时空不变性检测目标。首先,建立多尺度的图像金字塔,在每层上采用改进的形态学算法快速、粗糙定位小目标。然后进一步的根据目标在时空上的位置相关性,提出基于目标运动特征分析的精确检测方法。得到精确稳定的检测结果。最后实验结果表明与经典的形态学检测算法及其他算法相比,该技术能更有效地检测弱小目标,具有更高的鲁棒性。     

含有蓄能器的液压伺服系统动态特性仿真设计

该文以一类常见的电动液压能源为对象,建立了含有蓄能器的电动液压能源的仿真模型,并对能源的启动特性以及负载工作所要求的多种信号的跟踪能力进行了仿真分析。     

A web-based software tool for participatory optimization of conservation practices in watersheds

WRESTORE (Watershed Restoration Using Spatio-Temporal Optimization of Resources) is a web-based, participatory planning tool that can be used to engage with watershed stakeholder communities, and involve them in using science-based, human-guided, interactive simulation–optimization methods for designing potential conservation practices on their landscape. The underlying optimization algorithms, process simulation models, and interfaces allow users to not only spatially optimize the locations and types of new conservation practices based on quantifiable goals estimated by the dynamic simulation models, but also to include their personal subjective and/or unquantifiable criteria in the location and design of these practices. In this paper, we describe the software, interfaces, and architecture of WRESTORE, provide scenarios for implementing the WRESTORE tool in a watershed community's planning process, and discuss considerations for future developments.     

Design of disturbance observer based on adaptive-neural control for large-scale time-delay systems in the presence of actuator fault and unknown dead zone

This article presents an adaptive neural compensation scheme for a class of large-scale time delay nonlinear systems in the presence of unknown dead zone, external disturbances, and actuator faults. In this article, the quadratic Lyapunov–Krasovskii functionals are introduced to tackle the system delays. The unknown functions of the system are estimated by using radial basis function neural networks. Furthermore, a disturbance observer is developed to approximate the external disturbances. The proposed adaptive neural compensation control method is constructed by utilizing a backstepping technique. The boundedness of all the closed-loop signals is guaranteed via Lyapunov analysis and the tracking errors are proved to converge to a small neighborhood of the origin. Simulation results are provided to illustrate the effectiveness of the proposed control approach.     

综采放顶煤工作面高位巷抽采关键技术研究

为了保证九里山矿1508工作面采空区瓦斯治理效果，通过现场数据测定、实验考察和理论分析，研究了推进度、抽采负压、抽采管网等高位巷抽采关键参数。研究结果表明，工作面煤层越厚、推进度越快，瓦斯涌出量越大；孔抽期间理想抽采负压为25～30 kPa、巷抽期间理想抽采负压为5～10 kPa，高位巷并联支路及管路阻力会影响高位巷的抽采效果。     

The use of bio-diesel based additive as rheology improver and pour point depressant of Nigerian waxy crude

The chemical method has proved to be the most effective mitigating method of wax deposition in petroleum system as it deals with the root cause of wax formation. Most of the commercial chemicals in the industry are very expensive and toxic. This paper aims the use of biodiesel based additives for improving the rheological behavior and pour points of waxy crude from Nigeria field. The biodiesels derived additives gave better performance than the commercial chemical and the seed oils as greatly improvement in rheology and pour point values of the waxy crude were observed     

以用户为中心的可见光通信协作传输中训练资源分配算法

以用户为中心的可见光通信协作传输是近年来出现的新架构,这导致虚拟小区之间出现重叠。为避免导频污染问题,每个虚拟小区中的光接入点(AP)或者虚拟小区中选择相同AP的用户发送的训练序列应该是正交的。针对可见光通信中以用户为中心的协作网络,研究训练资源的正交分配问题,提出了一种新的导频分配算法,联合导频分配和用户选择问题,以期最大限度地增加虚拟小区内可被接入的用户数。分析和仿真结果表明,该导频分配方案可以有效改善导频污染问题,提高训练资源利用率,并且相比已有的导频分配方案,性能有所改进。     

化妆品功效评价(Ⅵ)——化妆品人体功效评价的实验设计

概述了化妆品人体功效评价实验设计的概念、基本要素和基本原则,介绍了常用实验设计类型和实验设计要点,提供了人体功效评价实验方案设计的思路,有助于提高研究者制定实验设计方案的水平。     

The robust knapsack problem with queries

We consider robust knapsack problems where item weights are uncertain. We are allowed to query an item to find its exact weight,where the number of such queries is bounded by a given parameter Q. After these queries are made, we need to pack the items robustly, i.e., so that the choice of items is feasible for every remaining possible scenario of item weights.The central question that we consider is: Which items should be queried in order to gain maximum profit? We introduce the notion of query competitiveness for strict robustness to evaluate the quality of an algorithm for this problem, and obtain lower and upper bounds on this competitiveness for interval-based uncertainty. Similar to the study of online algorithms, we study the competitiveness under different frameworks, namely we analyze the worst-case query competitiveness for deterministic algorithms, the expected query competitiveness for randomized algorithms and the average case competitiveness for known distributions of the uncertain input data. We derive theoretical bounds for these different frameworks and evaluate them experimentally. We also extend this approach to Γ-restricted uncertainties introduced by Bertsimas and Sim.Furthermore, we present heuristic algorithms for the problem. In computational experiments considering both the interval-based and the Γ-restricted uncertainty, we evaluate their empirical performance. While the usage of a Γ-restricted uncertainty improves the nominal performance of a solution (as expected), we find that the query competitiveness gets worse.